On Cyclically Resolvable Cyclic Steiner 2-Designs
نویسندگان
چکیده
منابع مشابه
A Few More Cyclic Steiner 2-Designs
In this paper, we prove the existence of a cyclic (v, 4, 1)-BIBD for v = 12t + 4, 3 ≤ t ≤ 50 using computer programs, which are useful in recursive constructions for cyclic designs. Applications of these designs to optical orthogonal codes are also mentioned.
متن کاملProduct constructions for cyclic block designs II. Steiner 2-designs
In [4] we introduced a product construction for cyclic Steiner quadruple systems. The purpose of this paper is to modify the construction so that it is applicable to cyclic Steiner 2-designs. A cyclic Steiner 2-design is a Steiner system s(t, k, u), 2 d t < k < u, in which t = 2 and which has an automorphism of order u. We denote such a system by CS(2, k, u). Under suitable conditions we show h...
متن کاملOn resolvable Steiner 2-designs and maximal arcs in projective planes
A combinatorial characterization of resolvable Steiner 2-(v, k, 1) designs embeddable as maximal arcs in a projective plane of order (v − k)/(k − 1) is proved, and a generalization of a conjecture by Andries Brouwer [9] is formulated.
متن کاملHalving Steiner 2-designs
A Steiner 2-design S(2,k,v) is said to be halvable if the block set can be partitioned into two isomorphic sets. This is equivalent to an edge-disjoint decomposition of a self-complementary graph G on v vertices into Kks. The obvious necessary condition of those orders v for which there exists a halvable S(2,k,v) is that v admits the existence of an S(2,k,v) with an even number of blocks. In th...
متن کاملOn the Classification of Resolvable 2-(12, 6, 5c) Designs
In this paper we describe a backtrack search over parallel classes with a partial isomorph rejection to classify resolvable 2-(12, 6, 5c) designs. We use the intersection pattern between the parallel classes and the fact that any resolvable 2-(12, 6, 5c) design is also a resolvable 3-(12, 6, 2c) design to effectively guide the search. The method was able to enumerate all nonsimple resolutions a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1999
ISSN: 0097-3165
DOI: 10.1006/jcta.1998.2924